Formulations and valid inequalities for the capacitated dispersion problem
نویسندگان
چکیده
منابع مشابه
Valid inequalities and facets of the capacitated plant location problem
Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems. In this paper, we investigate the polyhedral structure of the capacitated plant location problem. Our purpose is to identify facets and valid inequalities for a wide ran...
متن کاملNew formulations and valid inequalities for a bilevel pricing problem
We consider the problem of maximizing the revenue raised from tolls set on the links of a multicommodity transportation network. Since an optimal policy must balance toll levels against utilization rates, this problem lends itself naturally to a bilevel formulation, where network users assign themselves to shortest paths with respect to a disutility defined as the sum of travel time and out-of-...
متن کاملNew Valid Inequalities for the Two-Echelon Capacitated Vehicle Routing Problem
Multi-echelon distribution systems are quite common in supply-chain and logistic management. They are used by public administrations in their transportation and traffic planning strategies as well as by companies to model their distribution systems. In the literature, most studies address issues related to the movement of flows throughout the system from the origins to their final destinations....
متن کاملThe Multilayer Capacitated Survivable IP Network Design Problem : valid inequalities and Branch-and-Cut
Telecommunication networks can be seen as the stacking of several layers like, for instance, IPover-Optical networks. This infrastructure has to be sufficiently survivable to restore the traffic in the event of a failure. Moreover, it should have adequate capacities so that the demands can be routed between the origin-destinations. In this paper we consider the Multilayer Capacitated Survivable...
متن کاملSolving the Heterogeneous Capacitated Vehicle Routing Problem using K-Means Clustering and Valid Inequalities
The Capacitated Vehicle Routing Problem (CVRP) is one of the most popular routing problems. In the CVRP, a fleet of capacitated vehicles located at a central depot are used to deliver products to a set of geographically dispersed customers with known demand. In this work, a new two-step approach to solve the CVRP with a heterogeneous fleet is proposed. In the first step; a balanced K-means clus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2022
ISSN: ['0028-3045', '1097-0037']
DOI: https://doi.org/10.1002/net.22132